Correction: Micropatterning neuronal networks
نویسندگان
چکیده
منابع مشابه
Micropatterning neuronal networks.
Spatially organised neuronal networks have wide reaching applications, including fundamental research, toxicology testing, pharmaceutical screening and the realisation of neuronal implant interfaces. Despite the large number of methods catalogued in the literature there remains the need to identify a method that delivers high pattern compliance, long-term stability and is widely accessible to n...
متن کاملSignal Propagation between Neuronal Populations Controlled by Micropatterning
The central nervous system consists of an unfathomable number of functional networks enabling highly sophisticated information processing. Guided neuronal growth with a well-defined connectivity and accompanying polarity is essential for the formation of these networks. To investigate how two-dimensional protein patterns influence neuronal outgrowth with respect to connectivity and functional p...
متن کاملCorrection: Emergence of Slow-Switching Assemblies in Structured Neuronal Networks
Unraveling the interplay between connectivity and spatio-temporal dynamics in neuronal networks is a key step to advance our understanding of neuronal information processing. Here we investigate how particular features of network connectivity underpin the propensity of neural networks to generate slow-switching assembly (SSA) dynamics, i.e., sustained epochs of increased firing within assemblie...
متن کاملMicropatterning on micropost arrays.
Micropatterning of cells can be used in combination with microposts to control cell shape or cell-to-cell interaction while measuring cellular forces. The protocols in this chapter describe how to make SU8 masters for stamps and microposts, how to use soft lithography to replicate these structures in polydimethylsiloxane, and how to functionalize the surface of the microposts for cell attachment.
متن کاملCorrection Networks
We consider the problem of sorting sequences obtained from a sorted sequence of n keys by changing the values of at most k keys at some unknown positions. Since even for k = 1 a lower bound Ω(logn) on the number of parallel comparison steps applies, any comparator network solving this problem cannot be asymptotically faster than the AKS sorting network. We design a comparator network which sort...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Analyst
سال: 2016
ISSN: 0003-2654,1364-5528
DOI: 10.1039/c6an90037b